computational complexity theory

Results: 2049



#Item
141Computational complexity theory / Theory of computation / Mathematics / Operations research / Complexity classes / Mathematical optimization / Structural complexity theory / Theoretical computer science / NP / Linear programming / Algorithm / Reduction

A maximum feasible linear subsystem problem for modeling noise pollution around airports Sandra Hommersom)

Add to Reading List

Source URL: www.math.ru.nl

Language: English - Date: 2016-04-12 05:51:20
142Computational complexity theory / Operations research / Theory of computation / Mathematics / Knapsack problem / Optimization problem / NP / Mathematical optimization / Polynomial-time approximation scheme / Dynamic programming / Time complexity / Isolation lemma

CS264: Homework #8 Due by midnight on Wednesday, November 19, 2014 Instructions: (1) Students taking the course pass-fail should complete the exercises. Students taking the course for a letter grade should also complete

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-11-14 09:53:16
143Computational complexity theory / Mathematical optimization / Multi-objective optimization / Base / Approximation algorithms / Mathematics

The Maximum Hypervolume Set Yields Near-optimal Approximation Karl Bringmann Tobias Friedrich

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2016-01-03 06:45:08
144Computational complexity theory / Theory of computation / Analysis of algorithms / NP-complete problems / Set cover problem / Randomized algorithm / Time complexity / Minimum spanning tree / Point location

Output-Sensitive Construction of the Union of Triangles  Esther Ezra and Micha Sharir School of Computer Science

Add to Reading List

Source URL: www.math.tau.ac.il

Language: English - Date: 2007-08-27 22:45:23
145Graph theory / Mathematics / Computational complexity theory / NP-complete problems / Hamiltonian path / Eulerian path / Travelling salesman problem / Cycle / Seven Bridges of Knigsberg / Path / NP-completeness / Shortest path problem

CS681: Advanced Topics in Computational Biology Week 7 Lectures 2-3 Can Alkan EA224

Add to Reading List

Source URL: www.cs.bilkent.edu.tr

Language: English - Date: 2012-03-26 04:52:47
146Operations research / Approximation algorithm / Computational complexity theory / WAOA-FM / Mathematical optimization / Bin packing problem / Mathematics / Applied mathematics

ALGO 2010 ATMOS/WAOA schedule THURSDAY 9 Sept:30 - 9:00 9:00 - 9:50 10::20

Add to Reading List

Source URL: algo2010.csc.liv.ac.uk

Language: English - Date: 2010-09-01 10:39:54
147Computational complexity theory / Graph theory / Mathematics / NP-complete problems / Combinatorial optimization / Matching / Vertex cover / Gene

The breakpoint distance for signed sequences (extended abstract) Guillaume Blin1 , Cedric Chauve2 and Guillaume Fertin1 1 2

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2009-07-03 08:56:58
148Online algorithms / Analysis of algorithms / Cache / Computer science / Applied mathematics / Mathematics / Cache algorithms / Algorithm / Competitive analysis / Computational complexity theory / Page replacement algorithm

CS264: Beyond Worst-Case Analysis Lecture #4: Parameterized Analysis of Online Paging∗ Tim Roughgarden† October 1,

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-11-02 12:34:37
149Computational complexity theory / Theory of computation / Mathematics / NP-complete problems / Set cover problem / NP / Dominating set / Approximation algorithm / Metric k-center / Optimization problem / Reduction / P versus NP problem

Approximability Results for the p-Center Problem Stefan Buettcher Course Project Algorithm Design and Analysis

Add to Reading List

Source URL: stefan.buettcher.org

Language: English - Date: 2004-09-19 21:38:52
150Computational complexity theory / Complexity classes / Theory of computation / NP / P / Reduction / Time complexity

What makes the Arc-Preserving Subsequence problem hard?⋆ Guillaume Blin1 , Guillaume Fertin1 , Romeo Rizzi2 , and St´ephane Vialette3 1 2

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2009-07-03 08:56:58
UPDATE